Irreducible Factorization Lengths and the Elasticity Problem within N
نویسندگان
چکیده
A large class of multiplicative submonoids of the natural numbers is presented, which includes congruence monoids as well as numerical monoids (by isomorphism). For monoids in this class, the important factorization property of finite elasticity is characterized.
منابع مشابه
Irreducible Factorization Lengths and the Elasticity Problem within ℕ
A large class of multiplicative submonoids of the natural numbers is presented, which includes congruence monoids as well as numerical monoids (by isomorphism). For monoids in this class, the important factorization property of finite elasticity is characterized.
متن کاملNon-unique factorization of polynomials over residue class rings of the integers
We investigate non-unique factorization of polynomials in Zpn [x] into irreducibles. As a Noetherian ring whose zero-divisors are contained in the Jacobson radical, Zpn [x] is atomic. We reduce the question of factoring arbitrary non-zero polynomials into irreducibles to the problem of factoring monic polynomials into monic irreducibles. The multiplicative monoid of monic polynomials of Zpn [x]...
متن کاملOn the Elasticity of Generalized Arithmetical Congruence Monoids
An arithmetical congruence monoid (or ACM ) is a multiplicative monoid, which consists of an arithmetic sequence and the element 1. As they are traditionally defined, it is required that a ≤ b and a ≡ a (mod b) must hold to ensure closure. It is well known that unique factorization need not occur in ACMs. In this paper, we investigate factorization results when the requirement a ≤ b is dropped....
متن کاملOn Factorization Properties of Semi-Regular Congruence Monoids
If given n ∈ N and Γ, a multiplicatively closed subset of Zn, then the set HΓ = {n ∈ Z : x ∈ N : x + nZ ∈ Γ} ∪ {1} is a multiplicative submonoid of N0 known as a congruence monoid. Much work has been done to characterize the factorial (every element has unique factorization) and half-factorial (lengths of irreducible factorizations of an element remain constant) properties of such objects. Our ...
متن کاملAccepted Elasticity in Local Arithmetic Congruence Monoids
For certain a, b ∈ N, the Arithmetic Congruence Monoid M(a, b) is a multiplicatively closed subset of N given by {x ∈ N : x ≡ a (mod b)}∪{1}. An irreducible in this monoid is any element that cannot be factored into two elements, each greater than 1. Each monoid element (apart from 1) may be factored into irreducibles in at least one way. The elasticity of a monoid element (apart from 1) is the...
متن کامل